A characterization of discretized polygonal convex regions by discrete momentsZUNIC, Jovisa.Lecture notes in computer science. 2003, pp 529-536, issn 0302-9743, isbn 3-540-20590-X, 8 p.Conference Paper

Optimal algoriths for the intersection and the minimum distance problems between planar polygonsCHIN, F; CAO AN WANG.IEEE transactions on computers. 1983, Vol 32, Num 12, pp 1203-1207, issn 0018-9340Article

TessellationsFULTON, C.The American mathematical monthly. 1992, Vol 99, Num 5, pp 442-445, issn 0002-9890Article

On the time complexity for circumscribing a convex polygonWOO, T. C; HYUAN-CHAN LEE.Computer vision, graphics, and image processing. 1985, Vol 30, Num 3, pp 362-363, issn 0734-189XArticle

Non-periodic and not everywhere dense billiard trajectories in convex polygons and polyhedronsGALPERIN, G. A.Communications in mathematical physics. 1983, Vol 91, Num 2, pp 187-211, issn 0010-3616Article

A proof of Coleman's conjectureKOLODZIEJCZYK, Krzysztof; OLSZEWSKA, Daria.Discrete mathematics. 2007, Vol 307, Num 15, pp 1865-1872, issn 0012-365X, 8 p.Article

Plane polygons and a conjecture of Blaschle'sWAKSMAN, P.Advances in applied probability. 1985, Vol 17, Num 4, pp 774-793, issn 0001-8678Article

Cutting a country for smallest square fitVAN KREVELD, Marc; SPECKMANN, Bettina.Lecture notes in computer science. 2002, pp 91-102, issn 0302-9743, isbn 3-540-00142-5, 12 p.Conference Paper

Fast triangulation of the plane with respect to simple polygonsHERTEL, S; MEHLHORN, K.Information and control. 1985, Vol 64, Num 1-3, pp 52-76, issn 0019-9958Article

A simple hidden line algorithm for a structural model of planar elementsLAITANO, E. E; IDELSOHN, S. R.Advances in engineering software (1978). 1986, Vol 8, Num 1, pp 2-7, issn 0141-1195Article

On convex permutationsALBERT, Michael H; LINTON, Steve; RUSKUC, Nik et al.Discrete mathematics. 2011, Vol 311, Num 8-9, pp 715-722, issn 0012-365X, 8 p.Article

LARGE BICHROMATIC POINT SETS ADMIT EMPTY MONOCHROMATIC 4-GONSAICHHOLZER, Oswin; HACKL, Thomas; HUEMER, Clemens et al.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 4, pp 2147-2155, issn 0895-4801, 9 p.Article

On the existence of U-polygons of class c ≥4 in planar point setsHUCK, Christian.Discrete mathematics. 2009, Vol 309, Num 16, pp 4977-4981, issn 0012-365X, 5 p.Article

On the geometric structure of lattice U-polygonsDULIO, Paolo; PERI, Carla.Discrete mathematics. 2007, Vol 307, Num 19-20, pp 2330-2340, issn 0012-365X, 11 p.Article

Assessment of the intersection probabilities of random line segments and squaresYANG, M. C. K; CHUNG-CHUN YANG.Computer vision, graphics, and image processing. 1984, Vol 26, Num 3, pp 319-330, issn 0734-189XArticle

On computing the optimal bridge between two convex polygonsBHATTACHARYA, Binay; BENKOCZI, Robert.Information processing letters. 2001, Vol 79, Num 5, pp 215-221, issn 0020-0190Article

An ANSI C routine to determine if a point is within a specified convex polygon in logarithmic timeLARKIN, B.J.Computers & geosciences. 1991, Vol 17, Num 6, pp 841-847, issn 0098-3004, 7 p.Article

Computing the extreme distances between two convex polygonsEDELSBRUNNER, H.Journal of algorithms (Print). 1985, Vol 6, Num 2, pp 213-224, issn 0196-6774Article

Decomposition a polygon into simpler componentsMARK KEIL, J.SIAM journal on computing (Print). 1985, Vol 14, Num 4, pp 799-816, issn 0097-5397Article

An optimal algorithm for computing the minimum vertex distance between two crossing convex polygonsTOUSSAINT, G. T.Computing (Wien. Print). 1984, Vol 32, Num 4, pp 357-364, issn 0010-485XArticle

Exact and efficient construction of planar minkowski sums using the convolution methodWEIN, Ron.Lecture notes in computer science. 2006, pp 829-840, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

A geometric method for determining intersection relations between a movable convex object and a set of planar polygonsKAI TANG; LIU, Yong-Jin.IEEE transactions on robotics. 2004, Vol 20, Num 4, pp 636-650, issn 1552-3098, 15 p.Article

Partitioning a planar point set into empty convex polygonsREN DING; HOSONO, Kiyoshi; URABE, Masatsugu et al.Lecture notes in computer science. 2003, pp 129-134, issn 0302-9743, isbn 3-540-20776-7, 6 p.Conference Paper

An efficient algorithm for line clipping by convex polygonSKALA, V.Computers & graphics. 1993, Vol 17, Num 4, pp 417-421, issn 0097-8493Article

On Unfolding Lattice Polygons/Trees and Diameter-4 TreesPOON, Sheung-Hung.Lecture notes in computer science. 2006, pp 186-195, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper